Extending Graph Rewriting with Copying
نویسندگان
چکیده
The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a connu-ence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented .
منابع مشابه
SEN - R 9801 January 31 , 1998
We present a survey of connuence properties of (acyclic) term graph rewriting. Results and counterexamples are given for diierent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establis...
متن کاملEquational Term Graph Rewriting
We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Speciically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete latti...
متن کاملBisimilarity in Term Graph Rewriting
We present a survey of con uence properties of (acyclic) term graph rewriting. Results and counterexamples are given for di erent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establis...
متن کاملTerm Graphs and Principal Types for X
In this paper we study the calculus of circuits X , as first presented in [13] and studied in detail in [5]. We will present a number of new implementations of X using term graph rewriting techniques, which are improvements of the technique used in [6]. We will show that alpha conversion can be dealt with ‘on the fly’, and that explicit copying can be avoided, by presenting, discussing and comp...
متن کاملOn the Correctness of Bubbling
Bubbling, a recently introduced graph transformation for functional logic computations, is well-suited for the reduction of redexes with distinct replacements. Unlike backtracking, bubbling preserves operational completeness; unlike copying, it avoids the up-front construction of large contexts of redexes, an expensive and frequently wasteful operation. We recall the notion of bubbling and offe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993